منابع مشابه
Scheduling loosely connected task graphs
We present a polynomial time algorithm for precedence constrained scheduling problems in which the task graph can be partitioned into large disjoint parts by removing edges with high oat, where the oat of an edge is deened as the diierence between the length of the longest path in the graph and the length of the longest path containing the edge. Our algorithm guarantees schedules within a facto...
متن کاملConditional Task Scheduling on Loosely-Coupled Distributed Processors
The problem of scheduling tasks across loosely-coupled distributed processors systems has been proven to be NP-complete. Various heuristics have been proposed to achieve suboptimal solutions to this problem within acceptable computation complexity bounds. However, most proposals assume that the task model remains constant across program executions. This paper deals with the scheduling of tasks ...
متن کاملParameterizable Byzantine Broadcast in Loosely Connected Networks
We consider the problem of reliably broadcasting information in a multihop asynchronous network, despite the presence of Byzantine failures: some nodes are malicious and behave arbitrarly. We focus on non-cryptographic solutions. Most existing approaches give conditions for perfect reliable broadcast (all correct nodes deliver the good information), but require a highly connected network. A pro...
متن کاملScheduling Precedence Task Graphs with Disturbances
In this paper we consider the problem of scheduling precedence task graphs in parallel processing where there can be disturbances in computation and communication times. Such a phenomenon often occurs in practice, due to our inability to exactly predict the time because of system intrusion like cache miss and packet transmission time in mediums like ethernet etc. We propose a method based on th...
متن کاملScheduling balanced task-graphs to LogP-machines
This article discusses algorithms for scheduling task graphs G V E to LogP machines These algorithms depend on the granularity of G i e on the ratio of computation v and communication times in the LogP cost model and on the structure of G We de ne a class of coarse grained task graphs that can be scheduled with a performance guarantee of Topt G where Topt G is the time required for the optimal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2003
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(03)00071-0